On the randomized complexity of Banach space valued integration
نویسندگان
چکیده
منابع مشابه
On the randomized complexity of Banach space valued integration
We study the complexity of Banach space valued integration in the randomized setting. We are concerned with r-times continuously differentiable functions on the d-dimensional unit cube Q, with values in a Banach space X, and investigate the relation of the optimal convergence rate to the geometry of X. It turns out that the n-th minimal errors are bounded by cn−r/d−1+1/p if and only if X is of ...
متن کاملComplexity of Banach space valued and parametric stochastic Itô integration
We present a complexity analysis for strong approximation of Banach space valued and parameter dependent scalar stochastic Itô integration, driven by a Wiener process. Both definite and indefinite integration are considered. We analyze the Banach space valued version of the EulerMaruyama scheme. Based on these results, we define a multilevel algorithm for the parameter dependent stochastic inte...
متن کاملComplexity of Banach space valued and parametric integration
We study the complexity of Banach space valued integration. The input data are assumed to be r-smooth. We consider both definite and indefinite integration and analyse the deterministic and the randomized setting. We develop algorithms, estimate their error, and prove lower bounds. In the randomized setting the optimal convergence rate turns out to be related to the geometry of the underlying B...
متن کاملOn the character space of Banach vector-valued function algebras
Given a compact space $X$ and a commutative Banach algebra $A$, the character spaces of $A$-valued function algebras on $X$ are investigated. The class of natural $A$-valued function algebras, those whose characters can be described by means of characters of $A$ and point evaluation homomorphisms, is introduced and studied. For an admissible Banach $A$-valued function algebra...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2014
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm223-3-2